Termination of Single-Threaded One-Rule Semi-Thue Systems
نویسندگان
چکیده
This paper is a contribution to the long standing open problem of uniform termination of Semi-Thue Systems that consist of one rule s → t. McNaughton previously showed that rules incapable of (1) deleting t completely from both sides, (2) deleting t completely from the left, and (3) deleting t completely from the right, have a decidable uniform termination problem. We use a novel approach to show that Premise (2) or, symmetrically, Premise (3), is inessential. Our approach is based on derivations in which every pair of successive steps has an overlap. We call such derivations single-threaded.
منابع مشابه
Termination of String Rewriting Rules That Have One Pair of Overlaps
This paper presents a partial solution to the long standing open problem of termination of one rule string rewriting Overlaps between the two sides of the rule play a central role in existing termination criteria We characterize termination of all one rule string rewriting systems that have one such overlap at either end This both completes a result of Kurth and generalizes a result of Shikishi...
متن کاملOn Termination of One Rule Rewrite Systems
The undecidability of the termination of rewrite systems is usually proved by reduction to the halting of Turing machines. In particular, Dauchet proves the unde-cidability of the termination of one rule rewrite systems by coding Turing machines into one rule rewrite systems. Rewrite systems are a very simple model of computation and one may expect proofs in this model to be more straightforwar...
متن کاملOn One-Rule Grid Semi-Thue Systems
The family of one-rule grid semi-Thue systems, introduced by Alfons Geser, is the family of one-rule semi-Thue systems such that there exists a letter c that occurs as often in the left-hand side as the right-hand side of the rewriting rule. We prove that for any one-rule grid semi-Thue system S, the set S(w) of all words obtainable from w using repeatedly the rewriting rule of S is a construct...
متن کاملOn String Rewriting Systems
String rewriting systems, also known as semi-Thue systems, consist of a set of rules l → r, specifying valid replacements of substrings of strings over a given alphabet. In the case of one single rule, it is an open problem whether there is a system that is neither terminating nor looping. Another open question is the decidability of termination. Difficulties arise especially for non-confluent ...
متن کاملA Complete Characterization of Termination Of
We completely characterize termination of one-rule string rewriting systems of the form 0 p 1 q ! 1 r 0 s for every choice of positive integers p, q, r, and s. For the simply terminating cases, we give a sharp estimate of the complexity of derivation lengths.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005